Simplifying triangulations
نویسنده
چکیده
We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve. keywords. triangulations of surfaces, flip graphs, Dehn twists Mathematics Subject Classification (2010): 57M20
منابع مشابه
Simplifying Triangulations of S
In this paper we describe a procedure to simplify any given triangulation of S using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new recognition algorithm for the 3-sphere.
متن کاملSimplification paths in the Pachner graphs of closed orientable 3-manifold triangulations
It is important to have effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex before we can make it smaller than its original size. Here we present experimental work that suggests the reality is far different: for an exhaustive census of 81 800 39...
متن کاملSimplifying Triangulations of S 3
In this paper we describe a procedure to simplify any given triangulation of S 3 using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new recognition algorithm for the 3-sphere.
متن کاملSimplifying Polygonal Approximation of 2D Shapes
Shape Approximation requires simplifying a polygonalization of a smooth shape S with another polygonalization that has fewer number of vertices. The computed polygonalization should be homeomorphic to S and geometrically close to it. We present an algorithm that can provably simplify the initial polygonalization when the sampling density is high enough with respect to the feature size of the bo...
متن کاملAsymptotically efficient triangulations of the d-cube
Triangulating the regular d-cube I = [0, 1] in a “simple” way has many applications, like solving differential equations by finite element methods or calculating fixed points. See, for example, [7]. Determining the smallest number of simplices needed has brought special attention both from a theoretical point of view and from an applied one (see [6, Section 14.5.2] for a recent survey). Before ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1604.04314 شماره
صفحات -
تاریخ انتشار 2016